Lower bounds for quasianalytic functions, I. How to control smooth functions
نویسندگان
چکیده
منابع مشابه
Lower bounds for moments of L-functions.
The moments of central values of families of L-functions have recently attracted much attention and, with the work of Keating and Snaith [(2000) Commun. Math. Phys. 214, 57-89 and 91-110], there are now precise conjectures for their limiting values. We develop a simple method to establish lower bounds of the conjectured order of magnitude for several such families of L-functions. As an example ...
متن کاملOn error bounds for lower semicontinuous functions
We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents). For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f . In a reflexive Banach space X, we...
متن کاملRefinements of Lower Bounds for Polygamma Functions
0 te dt (1) for x > 0, the psi function ψ(x) = Γ ′(x) Γ(x) and the polygamma functions ψ (x) for i ∈ N are a series of important special functions and have much extensive applications in many branches such as statistics, probability, number theory, theory of 0-1 matrices, graph theory, combinatorics, physics, engineering, and other mathematical sciences. In [9, Corollary 2], the inequality ψ(x)...
متن کاملComplexity Theoretic Lower Bounds on Cryptographic Functions
Acknowledgments First of all it is a pleasure to thank my supervisor Hans Ulrich Simon for the great support and the nice atmosphere in his research group. He has been a reliable source of encouragement and adv ice through all my years at the Ruhr-Universität Bochum. Thanks also to all the nice people I met at the " Lehrstuhl für Mathematik und Informatik " and the " Lehrstuhl für Informationss...
متن کاملBandwidth-Hard Functions: Reductions and Lower Bounds
Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs). MHFs have seen widespread applications including password hashing, key stretching and proofs of work. Several metrics have been proposed to quantify the ‘memory hardness’ of a function. Cumulative mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2004
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-14449